type internal/runtime/maps.bitset

29 uses

	internal/runtime/maps (current package)
		group.go#L43: type bitset uint64
		group.go#L49: func (b bitset) first() uintptr {
		group.go#L57: func bitsetFirst(b bitset) uintptr {
		group.go#L63: func (b bitset) removeFirst() bitset {
		group.go#L68: func (b bitset) removeBelow(i uintptr) bitset {
		group.go#L75: func bitsetRemoveBelow(b bitset, i uintptr) bitset {
		group.go#L78: 	return b &^ bitset(mask)
		group.go#L85: func (b bitset) lowestSet() bool {
		group.go#L92: func bitsetLowestSet(b bitset) bool {
		group.go#L98: func (b bitset) shiftOutLowest() bitset {
		group.go#L105: func bitsetShiftOutLowest(b bitset) bitset {
		group.go#L147: func (g ctrlGroup) matchH2(h uintptr) bitset {
		group.go#L155: func ctrlGroupMatchH2(g ctrlGroup, h uintptr) bitset {
		group.go#L165: 	return bitset(((v - bitsetLSB) &^ v) & bitsetMSB)
		group.go#L169: func (g ctrlGroup) matchEmpty() bitset {
		group.go#L177: func ctrlGroupMatchEmpty(g ctrlGroup) bitset {
		group.go#L185: 	return bitset((v &^ (v << 6)) & bitsetMSB)
		group.go#L190: func (g ctrlGroup) matchEmptyOrDeleted() bitset {
		group.go#L198: func ctrlGroupMatchEmptyOrDeleted(g ctrlGroup) bitset {
		group.go#L205: 	return bitset(v & bitsetMSB)
		group.go#L209: func (g ctrlGroup) matchFull() bitset {
		group.go#L217: func ctrlGroupMatchFull(g ctrlGroup) bitset {
		group.go#L224: 	return bitset(^v & bitsetMSB)
		table.go#L891: 		var groupMatch bitset